On the smallest simultaneous power nonresidue modulo a prime

نویسندگان

  • K. Ford
  • M. Z. Garaev
  • S. V. Konyagin
چکیده

Let p be a prime and p1, . . . , pr be distinct prime divisors of p− 1. We prove that the smallest positive integer n which is a simultaneous p1, . . . , pr-power nonresidue modulo p satisfies n < p 1/4−cr+o(1) (p → ∞) for some positive cr satisfying cr = e −(1+o(1))r (r → ∞). Mathematical Subject Classification: 11A15, 11A07, 11N29

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Power Residues and Nonresidues in Arithmetic Progressions

Let A: be an integer > 2 andp a prime such that vk(p) = (k,p — 1) > 1. Let bn + c(n = 0,1,. ..;b > 2,1 < c < b, (b,p) — (c,p) = 1) be an arithmetic progression. We denote the smallest kth power nonresidue in the progression bn + c by g(p,k,b,c), the smallest quadratic residue in the progression bn + c by r2(p,b,c), and the nth smallest prime kth power nonresidue by g„(p,k), n = 0, 1, 2,_ If C(p...

متن کامل

Ju l 2 00 6 Density of non - residues in short intervals

We show that for any fixed ε > 0, there are numbers δ > 0 and p 0 2 with the following property: for every prime p p 0 , there is an integer p δ < N p 1/(4 √ e)+ε such that the sequence 1, 2,. .. , N contains at least δN quadratic non-residues modulo p. We then apply this result to obtain a new estimate on the smallest quadratic nonresidue in a Beatty sequence.

متن کامل

Average Least Nonresidues

Steven Finch December 4, 2013 Fifty years separate two computations: the mean value of a certain function () over primes , mentioned in [1], and the mean value of () over all positive integers . We anticipate that the overlap between number theory and probability will only deepen with time. 0.1. Quadratic. Let () be the smallest positive quadratic nonresidue modulo   2. Erdős [2] prov...

متن کامل

Parity Results for p-Regular Partitions with Distinct Parts

We consider the partition function bp(n), which counts the number of partitions of the integer n into distinct parts with no part divisible by the prime p. We prove the following: Let p be a prime greater than 3 and let r be an integer between 1 and p−1, inclusively, such that 24r + 1 is a quadratic nonresidue modulo p. Then, for all nonnegative integers n, bp(pn + r) ≡ 0 (mod 2).

متن کامل

Products of Small Integers in Residue Classes and Additive Properties of Fermat Quotients

We show that for any ε > 0 and a sufficiently large cube-free q, any reduced residue class modulo q can be represented as a product of 14 integers from the interval [1, q 1/2+ε]. The length of the interval is at the lower limit of what is possible before the Burgess bound on the smallest quadratic nonresidue is improved. We also consider several variations of this result and give applications t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015